Eigenanalysis for Galerkin Reformulations of Uncertain ODE Systems Analysis and Reduction of Complex Networks Under Uncertainty
نویسندگان
چکیده
The integral curve of a system of ODEs with uncertain parameters will likewise be uncertain. Such a system can be reformulated into a system of Galerkin-projected ODEs that govern the coefficients of a (truncated) polynomial chaos (PC) representation of the (random) state variables. While this reformulated system is deterministic, it is of higher dimension. In this work we provide a framework for understanding the eigenstructure of the coefficient system and in what sense it represents the stochastic eigenstructure of the original uncertain system. We will discuss how the location of the eigenvalues of the Jacobian of the projected system are largely determined by the locus of eigenvalues of the Jacobian of the original uncertain system, regardless of PC order or choice of orthogonal polynomials. In particular, the eigenvalues of the coefficient system Jacobian are always in the convex hull of the essential numerical range of the uncertain Jacobian [1]. Furthermore, as the order of representation increases, there is a weak convergence of the eigenvalues of the coefficient system Jacobian toward the locus of the eigenvalues of the uncertain Jacobian. This convergence is established using orthogonal matrix polynomials [2]. The Jacobian of the coefficient system has a large number of high-dimensional eigenvectors. We will discuss the relationship between these eigenvectors and the stochastic eigenvectors of the uncertain Jacobian [3]. This approach is demonstrated in the analysis of a system describing the concentration levels in the oxidation of CO on a surface (Makeev et al., JCP, 2002). This system is oscillatory, exhibits a slow manifold, and features a Hopf bifurcation for certain parameter values. These parameters are considered to be uniform random variables (over a domain of interest). The uncertain state of the dynamical system at a specified time is represented on a basis of orthogonal polynomials using non-intrusive spectral projection. The eigenstructure of the uncertain Jacobian at this uncertain state is compared with the eigenstructure of the corresponding PC coefficient system. [1] B. Sonday, R. Berry, H. Najm, B. Debusschere. Eigenvalues of the Jacobian of a Galerkin-Projected Uncertain ODE System. SIAM Journal on Scientific Computing, 33(3):1212–1233, 2011. [2] R. Berry, H. Najm, B. Debusschere. Asymptotic Eigenvalue Distribution of Block Toeplitz Matrices Associated with Orthogonal Polynomials. in preparation, 2011. [3] R. Berry, H. Najm, B. Debusschere. Eigenvectors of the Jacobian of polynomial chaos representations of uncertain ODE systems. in preparation, 2011.
منابع مشابه
Uncapacitated phub center problem under uncertainty
Hubs are facilities to collect arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this paper, an uncapacitated phub center problem in case of single allocation and also multiple allocation will be introduced in which travel times or transportation costs are considered as fuzzy parameters. Then, by proposing new methods, the presented problem is con...
متن کاملModelling and Compensation of uncertain time-delays in networked control systems with plant uncertainty using an Improved RMPC Method
Control systems with digital communication between sensors, controllers and actuators are called as Networked Control Systems (NCSs). In general, NCSs encounter with some problems such as packet dropouts and network induced delays. When plant uncertainty is added to the aforementioned problems, the design of the robust controller that is able to guarantee the stability, becomes more complex. In...
متن کاملPerformance Appraisal of Research and Development Projects Value-Chain for Complex Products and Systems: The Fuzzy Three-Stage DEA Approach
The purpose of the current research is to provide a performance appraisal system capable of considering the value chain network structure of research and development (R&D) projects for Complex products and systems (CoPS) under uncertainty of data. Therefore, in order to achieve this goal, a network data envelopment analysis (NDEA) approach and the possibilistic programming to provide a new fuzz...
متن کاملA Single Machine Capacitated Production Planning Problem Under Uncertainty: A Grey Linear Programming Approach
The production planning is an important problem in most of manufacturing systems in practice. Unlike many researches existing in literature, this problem encounters with great uncertainties in parameters and input data. In this paper, a single machine capacitated production planning problem is considered and a linear programming formulation is presented. The production costs are assumed to be u...
متن کاملA Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm
Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...
متن کامل